Constructions of Maximum Few-Distance Sets in Euclidean Spaces
نویسندگان
چکیده
منابع مشابه
Acute Sets In Euclidean Spaces
A finite set H in Rd is called an acute set if any angle determined by three points of H is acute. We examine the maximal cardinality α(d) of a d-dimensional acute set. The exact value of α(d) is known only for d ≤ 3. For each d ≥ 4 we improve on the best known lower bound for α(d). We present different approaches. On one hand, we give a probabilistic proof that α(d) > c · 1.2d. (This improves ...
متن کاملSmooth Euclidean 4–spaces with few symmetries
We say that a topologically embedded 3–sphere in a smoothing of Euclidean 4–space is a barrier provided, roughly, no diffeomorphism of the 4–manifold moves the 3–sphere off itself. In this paper we construct infinitely many one parameter families of distinct smoothings of 4–space with barrier 3–spheres. The existence of barriers implies, amongst other things, that the isometry group of these ma...
متن کاملUltrametric sets in Euclidean point spaces
Finite sets S of points in a Euclidean space the mutual distances of which satisfy the ultrametric inequality (A;B) maxf (A;C); (C;B)g for all points in S are investigated and geometrically characterized. Inspired by results on ultrametric matrices and previous results on simplices, connections with so-called centered metric trees as well as with strongly isosceles right simplices are found. AM...
متن کاملSome Constructions of Superimposed Codes in Euclidean Spaces
We describe three new methods for obtaining superimposed codes in Euclidean spaces. With help of them we construct codes with parameters improving upon known constructions. We also prove that the spherical simplex code is not optimal as superimposed code at least for dimensions greater than 9. ? 2003 Elsevier Science B.V. All rights reserved.
متن کاملBreaching Euclidean distance-preserving data perturbation using few known inputs
We examine Euclidean distance preserving data perturbation as a tool for privacy-preserving data mining. Such perturbations allow many important data mining algorithms, with only minor modification, to be applied to the perturbed data and produce exactly the same results as if applied to the original data, e.g. hierarchical clustering and k-means clustering. However, the issue of how well the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/8565